Polynomially convex arcs in polynomially convex simple closed curves

نویسندگان

چکیده

We prove that every polynomially convex arc is contained in a simple closed curve. also establish results about polynomial hulls of arcs and curves are locally rectifiable outside subset.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Polynomially Convex Sets

I. Local descriptions of the hulls. To begin, we explain what we mean by a curve of analytic hypersurfaces in an open subset, 0, of C. If U is a domain in O and Ft, 0 St < 1, is a curve of nonconstant analytic functions on £7, we let Ht be the zero-set of Ft in U. If each Ht is closed in 0, then we say that (Ftl Ht) is a curve of analytic hypersurfaces in O. We shall denote it, simply, by (Ht)....

متن کامل

Surfaces with Degenerate Cr Singularities That Are Locally Polynomially Convex

A compact subset K ⊂ C is said to be polynomially convex if for every point ζ / ∈ K, there exists a holomorphic polynomial P such that P (ζ) = 1 and supK |P | < 1. K is said to be locally polynomially convex at a point p ∈ K if there exists a closed ball B(p) centered at p such that K ∩ B(p) is polynomially convex. In general, it is difficult to determine whether a given compact K ⊂ C is polyno...

متن کامل

Convex drawings of intersecting families of simple closed curves

A FISC or family of intersecting simple closed curves is a collection of simple closed curves in the plane with the properties that there is some open region common to the interiors of all the curves, and that every two curves intersect in nitely many points. Let F be a FISC. Intersections of the curves represent the vertices of a plane graph, G(F), whose edges are the curve arcs between vertic...

متن کامل

Small Convex Covers for Convex Unit Arcs

More than 40 years ago, Leo Moser stated a geometry problem on the plane asking for the least-area set that contains a congruent copy of every unit arc. The smallest set known, by Norwood and Poole in 2004, has area 0.26043. One interesting related problem is to focus on a set that contains a congruent copy of every convex unit arc. Such a set is called a cover for convex unit arcs. The smalles...

متن کامل

Convex Polyhedra without Simple Closed Geodesics

In 1905, in his famous article “Sur les lignes géodésiques des surfaces convexes” [1] H. Poincaré posed a question on the existence of at least three geometrically different closed geodesics without self-intersections on any smooth convex two-dimensional surface (2-surface) M homeomorphic to the two-dimensional sphere (2-sphere) S2. Each such geodesic splits the surface M into two domains homeo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 2022

ISSN: ['2330-1511']

DOI: https://doi.org/10.1090/proc/15726